A Deterministic Adjoint-Based Semi-Analytical Algorithm for Fast Response Change Computations in Proton Therapy

نویسندگان

چکیده

In this paper we propose a solution to the need for fast particle transport algorithm in Online Adaptive Proton Therapy capable of cheaply, but accurately computing changes patient dose metrics as result system parameters. We obtain proton phase-space density through product numerical one-dimensional Fokker-Planck equation and analytical Fermi-Eyges equation. Moreover, corresponding adjoint was derived solved flux. The together with flux metric (chosen energy deposited by beam variable region interest) allowed assessing accuracy our different perturbation ranges parameters regions interest. achieved negligible errors (1.1×10−6% 3.6×10−3%) small Hounsfield unit (HU) (–40 HU 40 HU) moderate (3% 17%) – line well-known limitation approaches large (–400 400 case most clinical interest where surrounds Bragg peak. Given these results coupled capability further improving timing performance it can be concluded that presents viable specific purpose Therapy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Algorithm for Connectivity-Based Computations in Dynamic Networks

Connectivity graphs are widely used in different branches of engineering, especially in ad hoc network analysis, decentralized control of Unmanned Air Vehicles (UAV) and robot control. In large network simulations, the extensive cost and the huge amount of memory required for performing the calculations is a major problem. Connectivity probability and propagation-based link reliability approach...

متن کامل

Fast Deterministic Computations on a Faulty PRAM

We develop a method to simulate deterministically the operational Parallel Random Access Machine (PRAM) on a PRAM prone to processor and memory failures. It is shown that an n-processor PRAM with a bounded fraction of faulty processors and memory cells can simulate de-terministically the fully operational PRAM with O(log n) slowdown, after preprocessing performed in time O(log 2 n).

متن کامل

Fast SFFS-Based Algorithm for Feature Selection in Biomedical Datasets

Biomedical datasets usually include a large number of features relative to the number of samples. However, some data dimensions may be less relevant or even irrelevant to the output class. Selection of an optimal subset of features is critical, not only to reduce the processing cost but also to improve the classification results. To this end, this paper presents a hybrid method of filter and wr...

متن کامل

String-based Multi-adjoint Lattices for Tracing Fuzzy Logic Computations

Classically, most programming languages use in a predefined way the notion of “string” as an standard data structure for a comfortable management of arbitrary sequences of characters. However, in this paper we assign a different role to this concept: here we are concerned with fuzzy logic programming, a somehow recent paradigm trying to introduce fuzzy logic into logic programming. In this sett...

متن کامل

A Semi-analytical Solution for Flexural Vibration of Micro Beams Based on the Strain Gradient Theory

In this paper, the flexural free vibrations of three dimensional micro beams are investigated based on strain gradient theory. The most general form of the strain gradient theory which contains five higher-order material constants has been applied to the micro beam to take the small-scale effects into account. Having considered the Euler-Bernoulli beam model, governing equations of motion are w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of computational and theoretical transport

سال: 2023

ISSN: ['2332-4309', '2332-4325']

DOI: https://doi.org/10.1080/23324309.2023.2166077